Treebanks of Logical Forms: they are Useful Only if Consistent
نویسندگان
چکیده
Logical Forms are an exceptionally important linguistic representation for highly demanding semantically related tasks like Question/ Answering and Text Understanding, but their automatic production at runtime is higly error-prone. The use of a tool like XWNet and other similar resources would be beneficial for all the NLP community, but not only. The problem is: Logical Forms are useful as long as they are consistent, otherwise they would be useless if not harmful. Like any other resource that aims at providing a meaning representation, LFs require a big effort in manual checking order to reduce the number of errors to the minimum acceptable – less than 1% from any digital resource. As will be shown in detail in the paper, the available resources – XWNet, WN30-lfs, ILF suffer from lack of a careful manual checking phase, and the number of errors is too high to make the resource usable as is. We classified mistakes by their syntactic or semantic type in order to facilitate a revision of the resource that we intend to do using regular expressions. We also commented extensively on semantic issues and on the best way to represent them in Logical Forms.
منابع مشابه
A note on the problem when FS-domains coincide with RB-domains
In this paper, we introduce the notion of super finitely separating functions which gives a characterization of RB-domains. Then we prove that FS-domains and RB-domains are equivalent in some special cases by the following three claims: a dcpo is an RB-domain if and only if there exists an approximate identity for it consisting of super finitely separating functions; a consistent join-semilatti...
متن کاملA Semantics Oriented Grammar for Chinese Treebanking
Chinese grammar engineering has been a much debated task. Whilst semantic information has been reconed crucial for Chinese syntactic analysis and downstream applications, existing Chinese treebanks lack a consistent and strict sentential semantic formalism. In this paper, we introduce a semantics oriented grammar for Chinese, designed to provide basic supports for tasks such as automatic semant...
متن کاملDivergences in English-Hindi Parallel Dependency Treebanks
We present, here, our analysis of systematic divergences in parallel EnglishHindi dependency treebanks based on the Computational Paninian Grammar (CPG) framework. Study of structural divergences in parallel treebanks not only helps in developing larger treebanks automatically, but can also be useful for many NLP applications such as data-driven machine translation (MT) systems. Given that the ...
متن کاملMolecular-Friendly Histopathology
The rapidly expanding fields of pharmacogenomics and pharmacodiagnostics have presented the pathology laboratories with many challenges and opportunities. As custodians of patient tissues, these laboratories are in the logical position to perform biomolecular testing for proper management of patients. In order to meet these challenges, the pathology laboratories of the twenty-first century shou...
متن کاملArens regularity of bilinear forms and unital Banach module spaces
Assume that $A$, $B$ are Banach algebras and that $m:Atimes Brightarrow B$, $m^prime:Atimes Arightarrow B$ are bounded bilinear mappings. We study the relationships between Arens regularity of $m$, $m^prime$ and the Banach algebras $A$, $B$. For a Banach $A$-bimodule $B$, we show that $B$ factors with respect to $A$ if and only if $B^{**}$ is unital as an $A^{**}$-module. Le...
متن کامل